Quantum Convolutional Coding with Shared Entanglement: General Structure
نویسندگان
چکیده
Abstract—We present a general theory of entanglementassisted quantum convolutional coding. The codes have a convolutional or memory structure, they assume that the sender and receiver share noiseless entanglement prior to quantum communication, and they are not restricted to possess the CalderbankShor-Steane structure as in previous work. We provide two significant advances for quantum convolutional coding theory. We first show how to “expand” a given set of quantum convolutional generators. This expansion step acts as a preprocessor for a polynomial symplectic Gram-Schmidt orthogonalization procedure that simplifies the commutation relations of the expanded generators to be the same as those of entangled Bell states (ebits) and ancilla qubits. The above two steps produce a set of generators with equivalent error-correcting properties to those of the original generators. We then demonstrate how to perform online encoding and decoding for a stream of information qubits, halves of ebits, and ancilla qubits. The upshot of our theory is that the quantum code designer can engineer quantum convolutional codes with desirable error-correcting properties without having to worry about the commutation relations of these generators.
منابع مشابه
Entanglement-Assisted Quantum Convolutional Coding
We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary clas...
متن کاملQuantum Convolutional Coding
We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglementassisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary class...
متن کامل09 04 8 v 2 8 M ay 2 00 1 Optimal dense coding with mixed state entanglement
I investigate dense coding with a general mixed state on the Hilbert space C d ⊗C d shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary transformations with equal a priori probabilities, the capacity of dense coding is maximized. It is also proved that the optimal capacity of dense coding χ * satisfies E...
متن کاملQuantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources
The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also re...
متن کاملOn Lower Bound of Worst Case Error Probability for Quantum Fingerprinting with Shared Entanglement
This paper discusses properties of quantum fingerprinting with shared entanglement. Under certain restriction of final measurement, a relation is given between unitary operations of two parties. Then, by reducing to spherical coding problem, this paper gives a lower bound of worst case error probability for quantum fingerprinting with shared entanglement, showing a relation between worst case e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information Processing
دوره 9 شماره
صفحات -
تاریخ انتشار 2010